Independence [Humor]

Girth, minimum degree, independence, and broadcast independence

An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...

Humor Recognition and Humor Anchor Extraction

Humor is an essential component in personal communication. How to create computational models to discover the structures behind humor, recognize humor and even extract humor anchors remains a challenge. In this work, we first identify several semantic structures behind humor and design sets of features for each structure, and next employ a computational approach to recognize humor. Furthermore,...

Preface: Artificial Intelligence of Humor - Computational Humor

Human ability to communicate is incomplete without the use of humor. If a computational system is ever to approximate human communication ability or act as a competent partner in a conversation with a human, humor must be accounted for: it must be detected and dealt with appropriately, and it must be generated at need. Computing is becoming ubiquitous, with more and more systems entering the li...

Propositional Independence Conditional independence

Independence – the study of what is relevant to a given problem of reasoning – is an important AI topic. In this paper, we investigate several notions of conditional independence in propositional logic: Darwiche and Pearl’s conditional independence, and two more restricted forms of it, called strong conditional independence and perfect conditional independence. Many characterizations and proper...

Running head: SENSE OF HUMOR Sense of Humor